Complete analysis of a discrete-time batch service queue with batch-size-dependent service time under correlated arrival process: D-MAP/Gn(a,b)/1
نویسندگان
چکیده
Discrete-time queueing models find a large number of applications as they are used in modeling systems arising digital platforms like telecommunication and computer networks. In this paper, we analyze an infinite-buffer model with discrete Markovian arrival process. The units on served batches by single server according to the general bulk-service rule, service time follows distribution rate depending size batch being served. We mathematically formulate using supplementary variable technique obtain vector generating function at departure epoch. is turn extract joint queue content terms roots characteristic equation. Further, develop relationship between epoch arbitrary, pre-arrival outside observer’s epochs, where first latter ones. evaluate some essential performance measures system also discuss computing process extensively which demonstrated numerical examples.
منابع مشابه
Analysis of finite-buffer discrete-time batch-service queue with batch-size-dependent service
Over the last two decades there has been considerable growth in digital communication systems which operate on a slotted system. In several applications, transmission of packets over the network takes place in batches of varying size, and transmission time depends upon the size of the batch. Performance modelling of these systems is usually done using discrete-time queues. In view of this, we c...
متن کاملEmergency Service Vehicle Location Problem with Batch Arrival of Demands
In this paper an emergency service vehicle (ESV) location problem has been considered in which it is assumed that each emergency call may require more than one ESV. In ESV location problem two factors should be known; the location of stations and the number of ESVs at each station. Hence, a nonlinear mixed integer programming model is presented in order to maximize the total response rate to th...
متن کاملA Batch-Service Queueing Model with a Discrete Batch Markovian Arrival Process
Abstract. Queueing systems with batch service have been investigated extensively during the past decades. However, nearly all the studied models share the common feature that an uncorrelated arrival process is considered, which is unrealistic in several real-life situations. In this paper, we study a discrete-time queueing model, with a server that only initiates service when the amount of cust...
متن کاملQueue with Service Rates Depending on Service Batch Size
We consider a bulk service G I / M / l queue with service rates depending on service batch size. If there are n customers waiting at the completion of service, min(n, I\) customers enter service. We show that the queue size and the service batch size at points of arrivals form an embedded Markov chain and the steady-state probabilities of this Markov chain have the matrix geometric form. We des...
متن کاملFinite Buffer Vacation Queue under E-limited with Limit Variation Service and Batch Markovian Arrival Process
Abstract: We consider a finite-buffer single server queue with single (multiple) vacation(s) under batch Markovian Arrival Process (BMAP). The service discipline is varying number limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of l customers have been served. Queue length distributions at va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rairo-operations Research
سال: 2021
ISSN: ['1290-3868', '0399-0559']
DOI: https://doi.org/10.1051/ro/2021054